Batch sequencing and cooperation

Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs. This paper aims to extend the game theoretical approach to the cost allocation problems arising from sequencing situations on systems that consist of batch machines. To analyze the allocation problem at hand, it focusses on the existence of core elements, convexity, and the Shapley value.     

Energy efficient and reliable data delivery in urban sensing applications: A performance analysis

Urban sensing is an emerging application field for Wireless Sensor Networks (WSNs), where a number of static sensors is sparsely deployed in an urban area to collect environmental information. Data sensed by each sensor are, then, opportunistically transmitted to Mobile Nodes (MNs) that happen to be in contact. In the considered scenario, communications between MNs and sensors require paradigms with a minimal synchronization between devices, extremely fast and energy efficient, especially at the sensor side. To deal with the above issues, in [1] we proposed a hybrid protocol for data delivery from sensors to MNs, named Hybrid Adaptive Interleaved Data Protocol (HI). By combining Erasure Coding (EC) with an Automatic Repeat reQuest (ARQ) scheme, the proposed protocol maximizes the reliability of communications while minimizing the energy consumed by sensors. In this paper, we present an in-depth analysis of the HI performance. We provide an analytical evaluation by defining a flexible model to derive the probability of data delivery and exploiting it to investigate the performance over a wide range of parameters. Moreover, we perform an experimental study to evaluate the HI effectiveness on real sensor platforms. Specifically, we analyze the impact of resource constraints imposed by sensors on data delivery and provide a careful characterization of its actual consumption of resources.     

NetCluster: A clustering-based framework to analyze internet passive measurements data

Internet measured data collected via passive measurement are analyzed to obtain localization information on nodes by clustering (i.e., grouping together) nodes that exhibit similar network path properties. Since traditional clustering algorithms fail to correctly identify clusters of homogeneous nodes, we propose the NetCluster novel framework, suited to analyze Internet measurement datasets. We show that the proposed framework correctly analyzes synthetically generated traces. Finally, we apply it to real traces collected at the access link of Politecnico di Torino campus LAN and discuss the network characteristics as seen at the vantage point.     

Titans’ revenge: Detecting Zeus via its own flaws

Malware is one of the main threats to the Internet security in general, and to commercial transactions in particular. However, given the high level of sophistication reached by malware (e.g. usage of encrypted payload and obfuscation techniques), malware detection tools and techniques still call for effective and efficient solutions. In this paper, we address a specific, dreadful, and widely diffused financial malware: Zeus.The contributions of this paper are manifold: first, we propose a technique to break the encrypted malware communications, extracting the keystream used to encrypt such communications; second, we provide a generalization of the proposed keystream extraction technique. Further, we propose Cronus, an IDS that specifically targets Zeus malware. The implementation of Cronus has been experimentally tested on a production network, and its high quality performance and effectiveness are discussed. Finally, we highlight some principles underlying malware—and Zeus in particular—that could pave the way for further investigation in this field.     

A Parallel Implementation of Multiple Secret Image Sharing Based on Cellular Automata

Recently, a multisecret sharing scheme for secret color images among a set of users was proposed, which allows that each participant to share secret color images with the rest of participants in such way that all of them can recover all secret color images only if all participants pool their shares. In this work a parallel implementation of the cellular automata-based multisecret sharing scheme is proposed, in which the technology of CUDA （Compute Unified Device Architecture） is used in parallelization, taking advantage that each cell of cellular automata can be processed independently. The processing time of the proposed scheme is analyzed and it is proved that the proposed parallel algorithm using the CUDA structure is more than 12 times faster than the conventional sequential algorithm. This reduction of temporal complexity allows the practical use of the secret sharing scheme in many information security fields.     

Identifying and understanding urban sport areas using Nokia Sports Tracker

Current advancements in pervasive technologies allow users to create and share an increasing amount of whereabouts data. Thus, some rich datasets on human mobility are becoming available on the web. In this paper we extracted approximately 790,000 mobility traces from a web-based repository of GPS tracks—the Nokia Sports Tracker Service. Using data mining mechanisms, we show that this data can be analyzed to uncover daily routines and interesting schemes in the use of public spaces. We first show that our approach supports large-scale analysis of people’s whereabouts by comparing behavioral patterns across cities. Then, using Kernel Density Estimation, we present a mechanism to identify popular sport areas in individual cities. This kind of analysis allows us to highlight human-centered geographies that can support a wide range of applications ranging from location-based services to urban planning.     

Fabrication of layered polydimethylsiloxane/perfluoropolyether microfluidic devices with solvent compatibility and valve functionality

The development of multilayer soft lithography methodology has seen polydimethysiloxane (PDMS) as the preferred material for the fabrication of microfluidic devices. However, the functionality of these PDMS microfluidic chips is often limited by the poor chemical resistance of PDMS to certain solvents. Here, we propose the use of a photocurable perfluoropolyether (PFPE), specifically FOMBLIN^® MD40 PFPE, as a candidate material to provide a solvent-resistant buffer layer to make the device substantially impervious to chemically induced swelling. We first carried out a systematic study of the solvent resistance properties of FOMBLIN^® MD40 PFPE as compared with PDMS. The comparison presented here demonstrates the superiority of FOMBLIN^® MD40 PFPE over PDMS in this regard; moreover, the results permitted to categorize solvents in four different groups depending on their swelling ratio. We then present a step-by-step recipe for a novel fabrication process that uses multilayer lithography to construct a comprehensive solvent-resistant device with fluid and control channels integrated with a valve structure and also permitting easy establishment of outside connections.     

Workflows for Heliophysics

In this paper we describe how we have introduced workflows into the working practices of a community for whom the concept of workflows is very new, namely the heliophysics community. Heliophysics is a branch of astrophysics which studies the Sun and the interactions between the Sun and the planets, by tracking solar events as they travel throughout the Solar system. Heliophysics produces two major challenges for workflow technology. Firstly it is a systems science where research is currently developed by many different communities who need reliable data models and metadata to be able to work together. Thus it has major challenges in the semantics of workflows. Secondly, the problem of time is critical in heliophysics; the workflows must take account of the propagation of events outwards from the sun. They have to address the four dimensional nature of space and time in terms of the indexing of data. We discuss how we have built an environment for Heliophysics workflows building on and extending the Taverna workflow system and utilising the myExperiment site for sharing workflows. We also describe how we have integrated the workflows into the existing practices of the communities involved in Heliophysics by developing a web portal which can hide the technical details from the users, who can concentrate on the data from their scientific point of view rather than on the methods used to integrate and process the data. This work has been developed in the EU Framework 7 project HELIO, and is being disseminated to the worldwide Heliophysics community, since Heliophysics requires integration of effort on a global scale.